Hierarchical Datacubes

نویسندگان

چکیده

Many approaches have been proposed to pre-compute data cubes in order efficiently respond OLAP queries warehouses. However, few solutions integrating all of the possible outcomes, and it is this idea that leads integration hierarchical dimensions into these responses. To meet need, we propose, paper, a complete redefinition framework formal definition traditional database analysis through prism dimensions. After characterizing cube lattice, introduce its most concise reduced representation, closed cube. It offers compact replication so as optimize storage space by removing redundancies strongly correlated data. Such are typical warehouses, particular video games, our field study experimentation, where dimension attributes widely represented.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing Selections over Datacubes

Datacube queries compute aggregates over database relations at a variety of granularities. Often one wants only datacube output tuples whose aggregate value satisfies a certain condition, such as exceeding a given threshold. We develop algorithms for processing a datacube query using the selection condition internally during the computation. Thus, we can safely prune parts of the computation an...

متن کامل

Computing Full and Iceberg Datacubes Using Partitions

In this paper, we propose a sound approach and an algorithm for computing a condensed representation of either full or iceberg datacubes. A novel characterization of datacubes based on dimensional-measurable partitions is introduced. From such partitions, iceberg cuboids are achieved by using constrained product linearly in the number of tuples. Moreover, our datacube characterization provides ...

متن کامل

Fast Computation of Sparse Datacubes

Datacube queries compute aggregates over database relations at a variety of granularities, and they constitute an important class of decision support queries. Real-world data is frequently sparse, and hence efficiently computing datacubes over large sparse relations is important. We show that current techniques for computing datacubes over sparse relations do not scale well with the number of C...

متن کامل

An UML Profile and SOLAP Datacubes Multidimensional Schemas Transformation Process for Datacubes Risk-Aware Design

Spatial Data Warehouses (SDWs) and Spatial On-Line Analytical Processing (SOLAP) systems are new technologies for the integration and the analysis of huge volume of data with spatial reference. Spatial vagueness is often neglected in these types of systems and the data and analysis results are considered reliable. In a previous work, the authors provided a new design method for SOLAP datacubes ...

متن کامل

Summarizing Datacubes: Semantic and Syntactic Approaches

Datacubes are especially useful for answering efficiently queries on data warehouses. Nevertheless the amount of generated aggregated data is huge with respect to the initial data which is itself very large. Recent research work has addressed the issue of summarizing Datacubes in order to reduce their size. In this chapter, we present three different approaches. They propose structures which ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of computer and communications

سال: 2023

ISSN: ['2327-5219', '2327-5227']

DOI: https://doi.org/10.4236/jcc.2023.116004